Two theorems concerning recognizable N-subsets of σ∗
نویسندگان
چکیده
منابع مشابه
Recognizable Subsets of the Two Letter Plactic Monoid
The plactic monoid P la(a, b) on two letters will be studied from the point of view of classical language theory. In particular, we will give the fine structure of its recognizable subsets.
متن کاملSeparability of rational subsets by recognizable subsets is decidable in A∗ × N
Given a direct product of monoids M = A∗ ×N where A is finite and N is the additive monoid of nonnegative integers, the following problem is recursively decidable: given two rational subsests of M , does there exist a recognizable subset which includes one of the subsets and excludes the other.
متن کاملTwo theorems concerning the Bannai-Ito conjecture
In 1984 Bannai and Ito conjectured that there are finitely many distance-regular graphs with fixed valencies greater than two. In a series of papers, they showed that this is the case for valency 3 and 4, and also for the class of bipartite distance-regular graphs. To prove their result, they used a theorem concerning the intersection array of a triangle-free distance-regular graph, a theorem t...
متن کاملProofs of two Theorems concerning Sparse Spacetime Constraints
In the SIGGRAPH 2014 paper [SvTSH14] an approach for animating deformable objects using sparse spacetime constraints is introduced. This report contains the proofs of two theorems presented in the paper.
متن کاملPositive Integers n Such That σ ( φ ( n ) ) = σ ( n )
In this paper, we investigate those positive integers n for which the equality σ(φ(n)) = σ(n) holds, where σ is the sum of the divisors function and φ is the Euler function.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1976
ISSN: 0304-3975
DOI: 10.1016/0304-3975(76)90075-x